Low-Rank and Sparse Matrix Decomposition for Accelerated Dynamic MRI with Separation of Background and Dynamic Components

نویسندگان

  • Ricardo Otazo
  • Emmanuel Candès
  • Daniel K. Sodickson
چکیده

Purpose: To apply the low-rank plus sparse (L+S) matrix decomposition model to reconstruct undersampled dynamic MRI as a superposition of background and dynamic components in various problems of clinical interest. Theory and Methods: The L+S model is natural to represent dynamic MRI data. Incoherence between k-t space (acquisition) and the singular vectors of L and the sparse domain of S is required to reconstruct undersampled data. Incoherence between L and S is required for robust separation of background and dynamic components. Multicoil L+S reconstruction is formulated using a convex optimization approach, where the nuclear-norm is used to enforce low-rank in L and the l1-norm to enforce sparsity in S. Feasibility of the L+S reconstruction was tested in several dynamic MRI experiments with true acceleration including cardiac perfusion, cardiac cine, time-resolved angiography, abdominal and breast perfusion using Cartesian and radial sampling. Results: The L+S model increased compressibility of dynamic MRI data and thus enabled high acceleration factors. The inherent background separation improved background suppression performance compared to conventional data subtraction, which is sensitive to motion. Conclusion: The high acceleration and background separation enabled by L+S promises to enhance spatial and temporal resolution and to enable background suppression without the need of subtraction or modeling.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Low-rank plus sparse matrix decomposition for accelerated dynamic MRI with separation of background and dynamic components.

PURPOSE To apply the low-rank plus sparse (L+S) matrix decomposition model to reconstruct undersampled dynamic MRI as a superposition of background and dynamic components in various problems of clinical interest. THEORY AND METHODS The L+S model is natural to represent dynamic MRI data. Incoherence between k-t space (acquisition) and the singular vectors of L and the sparse domain of S is req...

متن کامل

Separation Between Anomalous Targets and Background Based on the Decomposition of Reduced Dimension Hyperspectral Image

The application of anomaly detection has been given a special place among the different   processings of hyperspectral images. Nowadays, many of the methods only use background information to detect between anomaly pixels and background. Due to noise and the presence of anomaly pixels in the background, the assumption of the specific statistical distribution of the background, as well as the co...

متن کامل

Dynamic Mode Decomposition for Real-Time Background/Foreground Separation in Video

This paper introduces the method of dynamic mode decomposition (DMD) for robustly separating video frames into background (low-rank) and foreground (sparse) components in real-time. The method is a novel application of a technique used for characterizing nonlinear dynamical systems in an equation-free manner by decomposing the state of the system into low-rank terms whose Fourier components in ...

متن کامل

Multi-Resolution Analysis of Dynamical Systems using Dynamic Mode Decomposition

We introduce the method of dynamic mode decomposition (DMD) for robustly separating complex systems into a hierarchy of multi-resolution time-scaled components. The method includes a methodology for background (low-rank) and foreground (sparse) separation of dynamical data. The method involves a technique used for characterizing nonlinear dynamical systems in an equation-free manner by decompos...

متن کامل

Respiratory motion correction in dynamic MRI using robust data decomposition registration - Application to DCE-MRI

Motion correction in Dynamic Contrast Enhanced (DCE-) MRI is challenging because rapid intensity changes can compromise common (intensity based) registration algorithms. In this study we introduce a novel registration technique based on robust principal component analysis (RPCA) to decompose a given time-series into a low rank and a sparse component. This allows robust separation of motion comp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013